ar X iv : m at h - ph / 0 20 60 18 v 1 1 3 Ju n 20 02 ENTROPY AND HADAMARD MATRICES
نویسنده
چکیده
The entropy of an orthogonal matrix is defined. It provides a new interpretation of Hadamard matrices as those that saturate the bound for entropy.It appears to be a useful Morse function on the group manifold. It has sharp maxima and other saddle points. The matrices corresponding to the maxima for 3 and 5 dimensions are presented. They are integer matrices (upto a rescaling.)
منابع مشابه
Entropy and Hadamard Matrices
The entropy of an orthogonal matrix is defined. It provides a new interpretation of Hadamard matrices as those that saturate the bound for entropy. It appears to be a useful Morse function on the group manifold. It has sharp maxima and other saddle points. The matrices corresponding to the maxima for 3 and 5 dimensions are presented. They are integer matrices (upto a rescaling.)
متن کاملHyperbolic Dynamical Systems
Contents Chapter 1. Introduction 7 1. Historical sketch 7 a. Homoclinic tangles 7 b. Geodesic flows 8 c. Picking up from Poincaré 8 d. Modern hyperbolic dynamics 9 e. The slowness of the initial development 9 2. Hyperbolic dynamics 10 3. Outline of this survey 10 a. Regularity 11 Chapter 2. Hyperbolic sets and stable manifolds 13 1. Definitions and examples 13 a. Hyperbolic linear maps, adapted...
متن کاملInformation theoretic inequalities
The role of inequalities in information theory is reviewed and the relationship of these inequalities to inequalities in other branches of mathematics is developed. Index Terms -Information inequalities, entropy power, Fisher information, uncertainty principles. I. PREFACE:~NEQUALITIES ININFORMATIONTHEORY I NEQUALITIES in information theory have been driven by a desire to solve communication th...
متن کاملStrong converse for the classical capacity of entanglement-breaking and Hadamard channels via a sandwiched Renyi relative entropy
A strong converse theorem for the classical capacity of a quantum channel states that the probability of correctly decoding a classical message converges exponentially fast to zero in the limit of many channel uses if the rate of communication exceeds the classical capacity of the channel. Along with a corresponding achievability statement for rates below the capacity, such a strong converse th...
متن کاملMatrices with banded inverses: Inversion algorithms and factorization of Gauss-Markov processes
The paper considers the inversion of full matrices whose inverses are -banded. We derive a nested inversion algorithm for such matrices. Applied to a tridiagonal matrix, the algorithm provides its explicit inverse as an element-wise product (Hadamard product) of three matrices. When related to Gauss–Markov random processes (GMrp), this result provides a closed-form factored expression for the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008